منابع مشابه
New results on edge-bandwidth
The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edge-bandwidth of hypercube and butterfly graphs and complete k-ary trees which extend and improve on previous known results. We also provide...
متن کاملEdge - Bandwidth
In this paper we discuss the edge-bandwidth of some families of graphs and characterize graphs by edge-bandwidth. In particular, bounds for m × n grids, triangular grids of size l, and the closure of the triangular grid T * l .
متن کاملOn the edge-bandwidth of graph products
The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptotically tight bounds on the edge-bandwidth of two dimensional grids and tori, the product of two cliques and the n-dimensional hypercube.
متن کاملEdge-Bandwidth of Graphs
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edgebandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly sharp bounds on the change in edge-bandwidth under addition, subdivision, or contracti...
متن کاملNew results on edge partitions of 1-plane graphs
A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a 1-plane graph such that any two pairs of crossing edges share at most one endvertex. An edge partition of a 1-plane graph G is a coloring of the edges of G with two colors, red and blue, such that both the graph induced by the red edges and the graph induced by the blue edges are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00234-2